<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Library Evolutionary Algorithms for Clustering (LEAC): include_inout/inparam_hka.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="leac_logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Library Evolutionary Algorithms for Clustering (LEAC)
   &#160;<span id="projectnumber">Version 1.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_6811ab4d66cfcd0145286a7c6e46fe51.html">include_inout</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">inparam_hka.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="inparam__hka_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#ifndef __IN_PARAM_HKA_HPP__</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#define __IN_PARAM_HKA_HPP__</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="inparam__gca_8hpp.html">inparam_gca.hpp</a>&quot;</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="preprocessor">#undef   __INPARAM_GCA__</span></div><div class="line"><a name="l00017"></a><span class="lineno"><a class="line" href="inparam__hka_8hpp.html#a41834d3586192992544c34361df98cad">   17</a></span>&#160;<span class="preprocessor">#define  __INPARAM_HKA__</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">namespace  </span><a class="code" href="namespaceinout.html">inout</a> {</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;  </div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_CLUSTERIDX, <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;           <span class="keyword">typename</span> T_INSTANCEIDX,</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;           <span class="keyword">typename</span> T_REAL,</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;           <span class="keyword">typename</span> T_FEATURE,</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;           <span class="keyword">typename</span> T_FEATURE_SUM,</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;           <span class="keyword">typename</span> T_INSTANCES_CLUSTER_K</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;           &gt;</div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html">   40</a></span>&#160;<span class="keyword">class </span><a class="code" href="classinout_1_1_in_param_h_k_a.html">InParamHKA</a>:</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;    <span class="keyword">public</span> <a class="code" href="classinout_1_1_in_param_g_c_a.html">InParamGCA</a>&lt;T_CLUSTERIDX,T_INSTANCEIDX,T_REAL,T_FEATURE,T_FEATURE_SUM,T_INSTANCES_CLUSTER_K&gt;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;{</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="keyword">public</span>:</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;  <a class="code" href="classinout_1_1_in_param_h_k_a.html#aa3ed106116fa5ed78487cb5cf90d9c4c">InParamHKA</a></div><div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#aa3ed106116fa5ed78487cb5cf90d9c4c">   45</a></span>&#160;  (<span class="keyword">const</span> std::string&amp; ais_algorithmoName,</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;   <span class="keyword">const</span> std::string&amp; ais_algorithmoAuthor,</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;   <a class="code" href="namespaceinout.html#ac1d864806f97108ebbfec769977f3ebb">InParam_algTypeOut</a> aiato_algTypeOut,</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;   <span class="keywordtype">int</span>                aii_opNorm</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;   ) :</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <a class="code" href="classinout_1_1_in_param_g_c_a.html">InParamGCA&lt;T_CLUSTERIDX,T_INSTANCEIDX,T_REAL,T_FEATURE,T_FEATURE_SUM,T_INSTANCES_CLUSTER_K&gt;</a></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    (ais_algorithmoName, ais_algorithmoAuthor, aiato_algTypeOut,aii_opNorm) {}</div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#aa682899082aa51f2ebe1d1e0d9d9d52a">   52</a></span>&#160;  <a class="code" href="classinout_1_1_in_param_h_k_a.html#aa682899082aa51f2ebe1d1e0d9d9d52a">~InParamHKA</a>() {}</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;  </div><div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a1c61164e921f73dd5a5667c78850a929">   54</a></span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classinout_1_1_in_param_h_k_a.html#a1c61164e921f73dd5a5667c78850a929">setOrderTournament</a>(<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> aist_orderTournament) </div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;  {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#a6bab344205407f3cd34caba118408db9">st_orderTournament</a> = aist_orderTournament;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;  }</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div><div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#abb69fd4512001867d0d68982793ff5a9">   59</a></span>&#160;  <span class="keyword">inline</span> <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> <a class="code" href="classinout_1_1_in_param_h_k_a.html#abb69fd4512001867d0d68982793ff5a9">getOrderTournament</a>() </div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;  {</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    <span class="keywordflow">return</span> this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#a6bab344205407f3cd34caba118408db9">st_orderTournament</a>;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;  }</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div><div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#ac55fbc60fb84d61bce6a86cb00a5b675">   64</a></span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classinout_1_1_in_param_h_k_a.html#ac55fbc60fb84d61bce6a86cb00a5b675">setNearestNeighbors</a>(<a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> aist_nearestNeighbors) </div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;  {</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#a7f6c0b8cbeb26359dc9b516f5dfa0997">st_nearestNeighbors</a> = aist_nearestNeighbors;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;  }</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a962f7871380959eb26e964a9c707d69e">   69</a></span>&#160;  <span class="keyword">inline</span> <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> <a class="code" href="classinout_1_1_in_param_h_k_a.html#a962f7871380959eb26e964a9c707d69e">getNearestNeighbors</a>() </div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;  {</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    <span class="keywordflow">return</span> this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#a7f6c0b8cbeb26359dc9b516f5dfa0997">st_nearestNeighbors</a>;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;  }</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;</div><div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a049ccb06fbd349558e00e7cc24fff463">   74</a></span>&#160;  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classinout_1_1_in_param_h_k_a.html#a049ccb06fbd349558e00e7cc24fff463">setProbSearchHeuristic</a>(T_REAL aiT_probSearchHeuristic) </div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;  {</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#ae1fd5c05f5ec51143e9be768ce8ccfc2">t_probSearchHeuristic</a> = aiT_probSearchHeuristic;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;  }</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a083bce13c7af64238efe60aba119eafb">   79</a></span>&#160;  <span class="keyword">inline</span> T_REAL <a class="code" href="classinout_1_1_in_param_h_k_a.html#a083bce13c7af64238efe60aba119eafb">getProbSearchHeuristic</a>() </div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;  {</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    <span class="keywordflow">return</span> this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#ae1fd5c05f5ec51143e9be768ce8ccfc2">t_probSearchHeuristic</a>;</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;  }</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a0d67d34fc71171c637fc302a1bbc8999">   84</a></span>&#160;  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classinout_1_1_in_param_h_k_a.html#a0d67d34fc71171c637fc302a1bbc8999">print</a>(std::ostream&amp;  aipf_outFile=std::cout, <span class="keyword">const</span> <span class="keywordtype">char</span> aic_separator=<span class="charliteral">&#39;,&#39;</span>)<span class="keyword"> const</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="keyword">  </span>{</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    <a class="code" href="classinout_1_1_in_param_g_c_a.html#ad6b0c3b555ca3b3e1ce85084a3ff1110">InParamGCA&lt;T_CLUSTERIDX,T_INSTANCEIDX,T_REAL,T_FEATURE,T_FEATURE_SUM,T_INSTANCES_CLUSTER_K&gt;</a></div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<a class="code" href="classinout_1_1_in_param_g_c_a.html#ad6b0c3b555ca3b3e1ce85084a3ff1110">      ::print</a>(aipf_outFile,aic_separator);</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;    aipf_outFile &lt;&lt; aic_separator &lt;&lt; <span class="stringliteral">&quot;_order of tournament&quot;</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                 &lt;&lt; aic_separator &lt;&lt; this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#a6bab344205407f3cd34caba118408db9">st_orderTournament</a>;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    aipf_outFile &lt;&lt; aic_separator &lt;&lt; <span class="stringliteral">&quot;_nearest neighbors (p)&quot;</span> </div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                 &lt;&lt; aic_separator &lt;&lt; <a class="code" href="classinout_1_1_in_param_h_k_a.html#a7f6c0b8cbeb26359dc9b516f5dfa0997">st_nearestNeighbors</a>;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;    aipf_outFile &lt;&lt; aic_separator &lt;&lt; <span class="stringliteral">&quot;_probability local search heuristic&quot;</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;                 &lt;&lt; aic_separator &lt;&lt; this-&gt;<a class="code" href="classinout_1_1_in_param_h_k_a.html#ae1fd5c05f5ec51143e9be768ce8ccfc2">t_probSearchHeuristic</a>;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;  }</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="keyword">protected</span>:</div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a6bab344205407f3cd34caba118408db9">   97</a></span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  <a class="code" href="classinout_1_1_in_param_h_k_a.html#a6bab344205407f3cd34caba118408db9">st_orderTournament</a>;</div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#a7f6c0b8cbeb26359dc9b516f5dfa0997">   98</a></span>&#160;  <a class="code" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>  <a class="code" href="classinout_1_1_in_param_h_k_a.html#a7f6c0b8cbeb26359dc9b516f5dfa0997">st_nearestNeighbors</a>;</div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="classinout_1_1_in_param_h_k_a.html#ae1fd5c05f5ec51143e9be768ce8ccfc2">   99</a></span>&#160;  T_REAL   <a class="code" href="classinout_1_1_in_param_h_k_a.html#ae1fd5c05f5ec51143e9be768ce8ccfc2">t_probSearchHeuristic</a>; </div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;};</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;} <span class="comment">/* END namespace inout</span></div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__IN_PARAM_HKA_HPP__*/</span><span class="preprocessor"></span></div><div class="ttc" id="namespaceinout_html_ac1d864806f97108ebbfec769977f3ebb"><div class="ttname"><a href="namespaceinout.html#ac1d864806f97108ebbfec769977f3ebb">inout::InParam_algTypeOut</a></div><div class="ttdeci">InParam_algTypeOut</div><div class="ttdef"><b>Definition:</b> <a href="inparam_8hpp_source.html#l00030">inparam.hpp:30</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_aa3ed106116fa5ed78487cb5cf90d9c4c"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#aa3ed106116fa5ed78487cb5cf90d9c4c">inout::InParamHKA::InParamHKA</a></div><div class="ttdeci">InParamHKA(const std::string &amp;ais_algorithmoName, const std::string &amp;ais_algorithmoAuthor, InParam_algTypeOut aiato_algTypeOut, int aii_opNorm)</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00045">inparam_hka.hpp:45</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html">inout::InParamHKA</a></div><div class="ttdoc">Input parameter for HKA a hybrid algorithm for k-medoid clustering .</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00040">inparam_hka.hpp:40</a></div></div>
<div class="ttc" id="namespaceinout_html"><div class="ttname"><a href="namespaceinout.html">inout</a></div><div class="ttdoc">Module for input and output parameters.</div></div>
<div class="ttc" id="inparam__gca_8hpp_html"><div class="ttname"><a href="inparam__gca_8hpp.html">inparam_gca.hpp</a></div><div class="ttdoc">Definition of GCA program parameters.</div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a083bce13c7af64238efe60aba119eafb"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a083bce13c7af64238efe60aba119eafb">inout::InParamHKA::getProbSearchHeuristic</a></div><div class="ttdeci">T_REAL getProbSearchHeuristic()</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00079">inparam_hka.hpp:79</a></div></div>
<div class="ttc" id="common_8hpp_html_a3f6c33fb604556cdc425e7aa2289d009"><div class="ttname"><a href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a></div><div class="ttdeci">uint32_t uintidx</div><div class="ttdef"><b>Definition:</b> <a href="common_8hpp_source.html#l00020">common.hpp:20</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_ac55fbc60fb84d61bce6a86cb00a5b675"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#ac55fbc60fb84d61bce6a86cb00a5b675">inout::InParamHKA::setNearestNeighbors</a></div><div class="ttdeci">void setNearestNeighbors(uintidx aist_nearestNeighbors)</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00064">inparam_hka.hpp:64</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a7f6c0b8cbeb26359dc9b516f5dfa0997"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a7f6c0b8cbeb26359dc9b516f5dfa0997">inout::InParamHKA::st_nearestNeighbors</a></div><div class="ttdeci">uintidx st_nearestNeighbors</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00098">inparam_hka.hpp:98</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a962f7871380959eb26e964a9c707d69e"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a962f7871380959eb26e964a9c707d69e">inout::InParamHKA::getNearestNeighbors</a></div><div class="ttdeci">uintidx getNearestNeighbors()</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00069">inparam_hka.hpp:69</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_ae1fd5c05f5ec51143e9be768ce8ccfc2"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#ae1fd5c05f5ec51143e9be768ce8ccfc2">inout::InParamHKA::t_probSearchHeuristic</a></div><div class="ttdeci">T_REAL t_probSearchHeuristic</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00099">inparam_hka.hpp:99</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a049ccb06fbd349558e00e7cc24fff463"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a049ccb06fbd349558e00e7cc24fff463">inout::InParamHKA::setProbSearchHeuristic</a></div><div class="ttdeci">void setProbSearchHeuristic(T_REAL aiT_probSearchHeuristic)</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00074">inparam_hka.hpp:74</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_abb69fd4512001867d0d68982793ff5a9"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#abb69fd4512001867d0d68982793ff5a9">inout::InParamHKA::getOrderTournament</a></div><div class="ttdeci">uintidx getOrderTournament()</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00059">inparam_hka.hpp:59</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_g_c_a_html"><div class="ttname"><a href="classinout_1_1_in_param_g_c_a.html">inout::InParamGCA</a></div><div class="ttdoc">Input parameter for GCA algorithm k-medoid clustering .</div><div class="ttdef"><b>Definition:</b> <a href="inparam__gca_8hpp_source.html#l00040">inparam_gca.hpp:40</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a6bab344205407f3cd34caba118408db9"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a6bab344205407f3cd34caba118408db9">inout::InParamHKA::st_orderTournament</a></div><div class="ttdeci">uintidx st_orderTournament</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00097">inparam_hka.hpp:97</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_aa682899082aa51f2ebe1d1e0d9d9d52a"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#aa682899082aa51f2ebe1d1e0d9d9d52a">inout::InParamHKA::~InParamHKA</a></div><div class="ttdeci">~InParamHKA()</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00052">inparam_hka.hpp:52</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a1c61164e921f73dd5a5667c78850a929"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a1c61164e921f73dd5a5667c78850a929">inout::InParamHKA::setOrderTournament</a></div><div class="ttdeci">void setOrderTournament(uintidx aist_orderTournament)</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00054">inparam_hka.hpp:54</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_h_k_a_html_a0d67d34fc71171c637fc302a1bbc8999"><div class="ttname"><a href="classinout_1_1_in_param_h_k_a.html#a0d67d34fc71171c637fc302a1bbc8999">inout::InParamHKA::print</a></div><div class="ttdeci">virtual void print(std::ostream &amp;aipf_outFile=std::cout, const char aic_separator=',') const</div><div class="ttdef"><b>Definition:</b> <a href="inparam__hka_8hpp_source.html#l00084">inparam_hka.hpp:84</a></div></div>
<div class="ttc" id="classinout_1_1_in_param_g_c_a_html_ad6b0c3b555ca3b3e1ce85084a3ff1110"><div class="ttname"><a href="classinout_1_1_in_param_g_c_a.html#ad6b0c3b555ca3b3e1ce85084a3ff1110">inout::InParamGCA::print</a></div><div class="ttdeci">virtual void print(std::ostream &amp;aipf_outFile=std::cout, const char aic_separator=',') const</div><div class="ttdef"><b>Definition:</b> <a href="inparam__gca_8hpp_source.html#l00064">inparam_gca.hpp:64</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Apr 19 2019 08:58:32 for Library Evolutionary Algorithms for Clustering (LEAC) by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
